English-Russian dictionary of computer abbreviations and terms. 2014.
Anytime algorithm — Introduction Most algorithms run to completion: they provide a single answer after performing some fixed amount of computation. In some cases, however, the user may wish to terminate the algorithm prior to completion. The amount of the… … Wikipedia
Anytime — may refer to:* Anytime (Brian McKnight album), and the title song * Anytime (1921 song), a popular song by Herbert Happy Lawson * Anytime (Kumi Koda song), a 2008 single by J Pop singer Kumi Koda * Anytime (Cheap Trick song) * A song by My… … Wikipedia
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Beam stack search — is a search algorithm which integrates backtracking with beam search.It was recently proposed by Rong Zhou and Eric A. Hansen, Department of Computer Science and Engineering, Mississippi State University during the 15th International Conference… … Wikipedia
Action selection — is a way of characterizing the most basic problem of intelligent systems: what to do next. In artificial intelligence and computational cognitive science, the action selection problem is typically associated with intelligent agents and animats… … Wikipedia
Partitionsproblem — Das Partitionsproblem (auch Zahlenaufteilungsproblem, oft mit PARTITION notiert) ist ein Optimierungs bzw. Entscheidungsproblem der Kombinatorik. Inhaltsverzeichnis 1 Formulierung des Partitionsproblems 2 Phasenübergang im Partitionsproblem … Deutsch Wikipedia
Defeasible reasoning — is a kind of reasoning that is based on reasons that are defeasible, as opposed to the indefeasible reasons of deductive logic. Defeasible reasoning is a particular kind of non demonstrative reasoning, where the reasoning does not produce a full … Wikipedia
PARTITION — Das Partitionsproblem (auch Zahlenaufteilungsproblem, oft mit PARTITION notiert) ist ein Optimierungs bzw. Entscheidungsproblem der Kombinatorik. Inhaltsverzeichnis 1 Formulierung des Partitionsproblems 2 Phasenübergang im Partitionsproblem 3… … Deutsch Wikipedia
Zahlenaufteilungsproblem — Das Partitionsproblem (auch Zahlenaufteilungsproblem, oft mit PARTITION notiert) ist ein Optimierungs bzw. Entscheidungsproblem der Kombinatorik. Inhaltsverzeichnis 1 Formulierung des Partitionsproblems 2 Phasenübergang im Partitionsproblem 3… … Deutsch Wikipedia
Artificial intelligence — AI redirects here. For other uses, see Ai. For other uses, see Artificial intelligence (disambiguation). TOPIO, a humanoid robot, played table tennis at Tokyo International Robot Exhibition (IREX) 2009.[1] Artificial intelligence ( … Wikipedia
